Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
نویسندگان
چکیده
منابع مشابه
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I (S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S = {u, v}, then I (S) = I [u, v] is called the interval between u and v and consists of all vertices that lie on some shortest u–v path in G. T...
متن کاملGeodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
Let G be a connected graph and S ⊆ V (G). Then the Steiner distance of S, denoted by dG(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner interval for a set S of vertices in a graph, denoted by I (S) is the union of all vertices that belong to some Steiner tree for S. If S = {u, v}, then ...
متن کاملOn the Steiner, geodetic and hull numbers of graphs
Given a graph G and a subset W ⊆ V (G), a Steiner W -tree is a tree of minimum order that contains all of W . Let S(W ) denote the set of all vertices in G that lie on some Steiner W -tree; we call S(W ) the Steiner interval of W . If S(W ) = V (G), then we call W a Steiner set of G. The minimum order of a Steiner set of G is called the Steiner number of G. Given two vertices u, v in G, a short...
متن کاملWeighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted Steiner tree in a distance-hereditary graph...
متن کاملSteiner distance stable graphs
Let G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance d,(S) of S is the smallest number of edges in a connected subgraph of G that contains S. Let k, I, s and m be nonnegative integers with m > s > 2 and k and I not both 0. Then a connected graph G is said to be k-vertex I-edge (s,m)-Steiner distance stable, if for every set S of s vertices of G with d,(S) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.04.037